Replicator Equations, Maximal Cliques, and Graph Isomorphism
نویسندگان
چکیده
منابع مشابه
Replicator Equations, Maximal Cliques, and Graph Isomorphism
We present a new energy-minimization framework for the graph isomorphism problem that is based on an equivalent maximum clique formulation. The approach is centered around a fundamental result proved by Motzkin and Straus in the mid-1960s, and recently expanded in various ways, which allows us to formulate the maximum clique problem in terms of a standard quadratic program. The attractive featu...
متن کاملEquations , Maximal Cliques , and Graph Isomorphism
We present a new energy-minimization framework for the graph isomorphism problem which is based on an equivalent maximum clique formulation. The approach is centered around a fundamental result proved by Motzkin and Straus in the mid-1960s, and recently expanded in various ways, which allows us to formulate the maximum clique problem in terms of a standard quadratic program. The attractive feat...
متن کاملCounting and Listing all Potential Maximal Cliques of a Graph
We show that the number of potential maximal cliques for an arbitrary graph G on n vertices is O∗(1.8135n), and that all potential maximal cliques can be listed in O∗(1.8899n) time. As a consequence of this results, treewidth and minimum fill-in can be computed in O∗(1.8899n) time.
متن کاملBoundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph
We characterize clique trees of a chordal graph in their relation to simplicial vertices and perfect sequences of maximal cliques. We investigate boundary cliques de ned by Shibata[23] and clarify their relation to endpoints of clique trees. Next we de ne a symmetric binary relation between the set of clique trees and the set of perfect sequences of maximal cliques. We describe the relation as ...
متن کاملListing All Potential Maximal Cliques of a Graph
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal triangulation of that graph. It is known that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum 5ll-in are polynomially tractable for these graphs. We show here that the potential maximal cliques of a graph can be generated in polynomial time i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Computation
سال: 1999
ISSN: 0899-7667,1530-888X
DOI: 10.1162/089976699300016034